Some Gradient Based Joint Diagonalization Methods for ICA
نویسندگان
چکیده
We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to develop continuous-time flows for joint diagonalization and derive their discretized versions. We employ the developed methods to construct a class of Independent Component Analysis (ICA) algorithms based on non-orthogonal joint diagonalization. These algorithms pre-whiten or sphere the data but do not restrict the subsequent search for the (reduced) un-mixing matrix to orthogonal matrices, hence they make effective use of both second and higher order statistics.
منابع مشابه
A Novel Non-orthogonal Joint Diagonalization Cost Function for ICA
We present a new scale-invariant cost function for non-orthogonal joint-diagonalization of a set of symmetric matrices with application to Independent Component Analysis (ICA). We derive two gradient minimization schemes to minimize this cost function. We also consider their performance in the context of an ICA algorithm based on non-orthogonal joint diagonalization.
متن کاملA Matrix Joint Diagonalization Approach for Complex Independent Vector Analysis
Independent Vector Analysis (IVA) is a special form of Independent Component Analysis (ICA) in terms of group signals. Most IVA algorithms are developed via optimizing certain contrast functions. The main difficulty of these contrast function based approaches lies in estimating the unknown distribution of sources. On the other hand, tensorial approaches are efficient and richly available to the...
متن کاملNon-Unitary Matrix Joint Diagonalization for Complex Independent Vector Analysis
Independent vector analysis (IVA) is a special form of independent component analysis (ICA), which has demonstrated its prominent performance in solving convolutive blind source separation (BSS) problems in the frequency domain. Most IVA algorithms are based on optimizing certain contrast functions, where the main difficulty of these approaches lies in finding a reliable and fast estimation of ...
متن کاملApproximate Joint Diagonalization Using a Natural Gradient Approach
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, complemented by step-size optimization at each iteration. The advantages of the new algorithm over existing non-unitary AJD algorithms are in the ability to accommodate non-positive-definite matrices (compared to Pham’s algorit...
متن کاملSimple LU and QR Based Non-orthogonal Matrix Joint Diagonalization
A class of simple Jacobi-type algorithms for non-orthogonal matrix joint diagonalization based on the LU or QR factorization is introduced. By appropriate parametrization of the underlying manifolds, i.e. using triangular and orthogonal Jacobi matrices we replace a high dimensional minimization problem by a sequence of simple one dimensional minimization problems. In addition, a new scale-invar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004